Abstract Syntax: Substitution and Binders: Invited Address
نویسنده
چکیده
Syntax: Substitution and Binders
منابع مشابه
INBOUND: Simple yet powerful Specification of Syntax with Binders
Nearly all meta-programming tools need to deal with binders in abstract syntax trees. Unfortunately, ubiquitous boilerplate functions for computing free variables and variable substitution are remarkably intricate and hard to get right. Moreover, the complexity quickly increases with larger languages and non-trivial binding forms. On top of that, the underlying scoping rules are only implicitly...
متن کاملAutosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
Reasoning about syntax with binders plays an essential role in the formalization of the metatheory of programming languages. While the intricacies of binders can be ignored in paper proofs, formalizations involving binders tend to be heavyweight. We present a discipline for syntax with binders based on de Bruijn terms and parallel substitutions, with a decision procedure covering all assumption...
متن کاملImplementing Reflection in Nuprl
Syntax : Syntax represented as data, similar to concrete syntax, except that irrelevant features are abstracted away. For this work, this is exactly like concrete syntax modulo alpha-equality. (Note that the “abstract” here is unrelated to functions, it is only to distinguished the represented syntax from the actual syntax.) Higher Order Abstract Syntax, HOAS : Similar to abstract syntax, excep...
متن کاملA New Approach to Abstract Syntax Involving Binders
The Fraenkel-Mostowski permutation model of set theory with atoms (FM-sets) can serve as the semantic basis of meta-logics for specifying and reasoning about formal systems involving name binding, -conversion, capture avoiding substitution, and so on. We show that in FM-set theory one can express statements quantifying over ‘fresh’ names and we use this to give a novel set-theoretic interpretat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 173 شماره
صفحات -
تاریخ انتشار 2007